On (<i>f, ρ</i>)−Statistical convergence and strong (<i>f, ρ</i>)−summability of order <i>α</i>
نویسندگان
چکیده
Abstract The main object of this article is to introduce the concepts ( f, ρ )− statistical convergence order α and strong summability sequences real numbers give some inclusion relations between these spaces.
منابع مشابه
Embedding If and Only If
Compounds of indicative conditionals present some puzzling phenomena. Perhaps most striking, some nested indicative conditionals are uninterpretable. Proponents of NTV hold that indicative conditionals do not have truth values, and they use this to explain why nested indicative conditionals are sometimes uninterpretable: the embedded conditional does not provide the truth conditions needed by t...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملEven if after If then conditionals
This study evaluates how people represent “even if” conditionals when they have to integrate them with previous “if then” conditionals and also make an inference. The terms in the premises were ordered to facilitate their integration (Figure 1: If A then B; Even if B C). In half the cases, the “even if” conditional was expressed with a negation instead of an affirmation (If A then B; Even if no...
متن کاملAlmost Everywhere Convergence in Family of IF-events With Product
The aim of this paper is to define the lower and upper limits on the family of IF-events with product. We compare two concepts of almost everywhere convergence and we show that they are equivalent, too.
متن کاملMarkets are efficient if and only if P = NP
I prove that if markets are efficient, meaning current prices fully reflect all information available in past prices, then P = NP , meaning every computational problem whose solution can be verified in polynomial time can also be solved in polynomial time. I also prove the converse by showing how we can “program” the market to solve NP -complete problems. Since P probably does not equal NP , ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E-Journal of Analysis and Applied Mathematics
سال: 2022
ISSN: ['2544-9990']
DOI: https://doi.org/10.2478/ejaam-2022-0002